Point-symmetric graphs and digraphs of prime order and transitive permutation groups of prime degree
نویسندگان
چکیده
منابع مشابه
Transitive Permutation Groups of Prime-Squared Degree
We explicitly determine all of the transitive groups of degree p2, p a prime, whose Sylow p-subgroup is not isomorphic to the wreath product Z p Z p . Furthermore, we provide a general description of the transitive groups of degree p2 whose Sylow p-subgroup is isomorphic to Z p Z p , and explicitly determine most of them. As applications, we solve the Cayley Isomorphism problem for Cayley objec...
متن کاملTwo-geodesic transitive graphs of prime power order
In a non-complete graph $Gamma$, a vertex triple $(u,v,w)$ with $v$ adjacent to both $u$ and $w$ is called a $2$-geodesic if $uneq w$ and $u,w$ are not adjacent. The graph $Gamma$ is said to be $2$-geodesic transitive if its automorphism group is transitive on arcs, and also on 2-geodesics. We first produce a reduction theorem for the family of $2$-geodesic transitive graphs of prime power or...
متن کاملHalf-Transitive Graphs of Prime-Cube Order
We call an undirected graph X half-transitive if the automorphism group Aut X of X acts transitively on the vertex set and edge set but not on the set of ordered pairs of adjacent vertices of X. In this paper we determine all half-transitive graphs of order p3 and degree 4, where p is an odd prime; namely, we prove that all such graphs are Cayley graphs on the non-Abelian group of order p3 and ...
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولAsymptotic automorphism groups of Cayley digraphs and graphs of abelian groups of prime-power order
We show that almost every Cayley graph Γ of an abelian group G of odd prime-power order has automorphism group as small as possible. Additionally, we show that almost every Cayley (di)graph Γ of an abelian group G of odd prime-power order that does not have automorphism group as small as possible is a normal Cayley (di)graph of G (that is, GL/Aut(Γ)).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1973
ISSN: 0095-8956
DOI: 10.1016/0095-8956(73)90027-0